An application of category-theoretic semantics to the characterisation of complexity classes using higher-order function algebras

We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ! deenes exactly the PTIME-functions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types. By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with b 1-induction over PV ! and use this to re-establish that the provably total functions in this system are in polynomial time computable. Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion.